Mixed Decision Trees: Minimizing Knowledge Representation Bias in LCS

نویسندگان

  • Xavier Llorà
  • Stewart W. Wilson
چکیده

Learning classifier systems tend to inherit—a priori—a given knowledge representation language for expressing the concepts to learn. Hence, even before getting started, this choice biases what can be learned, becoming critical for some real-world applications like data mining. However, such bias may be minimized by hybridizing different knowledge representations via evolutionary mixing. This paper presents a first attempt to produce an evolutionary framework that evolves mixed decision trees of heterogeneous knowledge representations.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A New Algorithm for Optimization of Fuzzy Decision Tree in Data Mining

Decision-tree algorithms provide one of the most popular methodologies for symbolic knowledge acquisition. The resulting knowledge, a symbolic decision tree along with a simple inference mechanism, has been praised for comprehensibility. The most comprehensible decision trees have been designed for perfect symbolic data. Classical crisp decision trees (DT) are widely applied to classification t...

متن کامل

Computing Least Common Subsumer in Description Logics with Existential Restrictions Computing Least Common Subsumer in Description Logics with Existential Restrictions

Computing the least common subsumer (lcs) is an inference task that can be used to support the \bottom-up" construction of knowledge bases for KR systems based on description logics. Previous work on how to compute the lcs has concentrated on description logics that allow for universal value restrictions, but not for existential restrictions. The main new contribution of this paper is the treat...

متن کامل

MOF-based Metamodeling for the XTT Knowledge Representation

This paper concerns the metamodel of the XTT rule-based knowledge representation. XTT is a knowledge representation and design method which aims at combining decision trees and decision tables. As the pure XTT method required dedicated tools to design systems, the UML representation has been developed. The abstract syntax of UML is defined by the UML metamodel. This paper introduces the metamod...

متن کامل

Inductive Learning in a Mixed Paradigm Setting

In a precedent-bused domain one appeals to previous cases to support a solution, decision, explanation, or an argument. Experts typically use care in choosing cases in precedent-based domains, and apply such criteria as case relevance, prototypicality, and importance. In domains where both cases and rules are used, experts use an additional case selection criterion: the generalizations that a p...

متن کامل

Applying Ant Colony Optimization for Inducing Decision Tree from Mixed Type of Relational Multiclass Data

Decision trees have been widely used in data mining and machine learning as a comprehensible knowledge representation. Originally the method to construct decision tree follows greedy approach which results in local tree and classification rules. Ant Colony Optimization (ACO) is a metaheuristic approach used to get more optimal solution compared to other methods from large search space. In propo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004